A Model for Measuring Cognitive Complexity of Software

This paper proposes a model for calculating cognitive complexity of a code. This model considers all major factors responsible for (cognitive) complexity. The practical applicability of the measure is evaluated through experimentation, test cases and comparative study

Applicability of Weyuker’s Properties on OO Metrics: Some Misunderstandings

Weyuker’s properties have been suggested as a guiding tool in identification of a good and comprehensive complexity measure by several researchers. Weyuker proposed nine properties to evaluate complexity measure for traditional programming. However, they are extensively used for evaluating object-oriented (OO) metrics, although the object-oriented features are entirely different in nature. In this paper, two recently reported OO metrics were evaluated and, based on it; the usefulness and relevance of these properties for evaluation purpose for object-oriented systems is discussed

Weighted Class Complexity: A Measure of Complexity for Object Oriented System

Software complexity metrics are used to predict critical information about reliability and maintainability of software systems. Object oriented software development requires a different approach to software complexity metrics. In this paper, we propose a metric to compute the structural and cognitive complexity of class by associating a weight to the class, called as Weighted Class Complexity (WCC). On the contrary, of the other metrics used for object oriented systems, proposed metric calculates the complexity of a class due to methods and attributes in terms of cognitive weight. The proposed metric has been demonstrated with OO examples. The theoretical and practical evaluations based on the information theory have shown that the proposed metric is on ratio scale and satisfies most of the parameters required by the measurement theor

Informatics Related Branch’s Curriculum and Role of Project Management

The most important goal of the software industry is to produce successful product. During the process of production several times the product fails due to lack of proper management. This paper is exploring the role of software engineering courses in computer engineering related branches and then reasons why software developers lack project management in proper software management trainings. Our findings reflect that in majority of computer related branches like computer science, computer engineering, information system engineering there is no place for software project management course. Our findings are based on a survey of course curriculums of computer engineering, computer science and information system engineering courses taught in Turkish universities

The role of leadership cognitive complexity in software development projects: An empirical assessment for simple thinking

Simple thinking (or simplicity) is a way of coping with complexity. It is especially important in the software development process (SDP), which is an error-prone, time-consuming, and complex activity. This article investigates the role of the thinking style—namely, simple thinking—which has been found effective in solving complicated problems during software development. For this purpose, it reviews and discusses simplicity issues from a general perspective and, then, reports the findings of a survey concerning the assessment of simplicity in SDP. The survey was conducted among information and communication technologies senior professionals and managers from government and private-sector organizations. Relevant hypotheses have been developed under different empirical categories for analysis. Statistical analysis techniques were then used to draw inferences based on these hypotheses. The results have proved simplicity to have a significant role in the SDP to a certain extent. © 2011 Wiley Periodicals, Inc

Lossless Text Compression Technique Using Syllable Based Morphology

In this paper, we present a new lossless text compression technique which utilizes syllable-based morphology of multi-syllabic languages. The proposed algorithm is designed to partition words into its syllables and then to produce their shorter bit representations for compression. The method has six main components namely source file, filtering unit, syllable unit, compression unit, dictionary file and target file. The number of bits in coding syllables depends on the number of entries in the dictionary file. The proposed algorithm is implemented and tested using 20 different texts of different lengths collected from different fields. The results indicated a compression of up to 43%

Turing test: 50 years later

The Turing Test is one of the most disputed topics in artificial intelligence, philosophy of mind, and cognitive science. This paper is a review of the past 50 years of the Turing Test. Philosophical debates, practical developments and repercussions in related disciplines are all covered. We discuss Turing's ideas in detail and present the important comments that have been made on them. Within this context, behaviorism, consciousness, the 'other minds' problem, and similar topics in philosophy of mind are discussed. We also cover the sociological and psychological aspects of the Turing Test. Finally, we look at the current situation and analyze programs that have been developed with the aim of passing the Turing Test.We conclude that the Turing Test has been, and will continue to be, an influential and controversial topic. © 2001 Kluwer Academic Publishers

Lagrange structure and quantization

A path-integral quantization method is proposed for dynamical systems whose classical equations of motion do \textit{not} necessarily follow from the action principle. The key new notion behind this quantization scheme is the Lagrange structure which is more general than the Lagrangian formalism in the same sense as Poisson geometry is more general than the symplectic one. The Lagrange structure is shown to admit a natural BRST description which is used to construct an AKSZ-type topological sigma-model. The dynamics of this sigma-model in $d+1$ dimensions, being localized on the boundary, are proved to be equivalent to the original theory in $d$ dimensions. As the topological sigma-model has a well defined action, it is path-integral quantized in the usual way that results in quantization of the original (not necessarily Lagrangian) theory. When the original equations of motion come from the action principle, the standard BV path-integral is explicitly deduced from the proposed quantization scheme. The general quantization scheme is exemplified by several models including the ones whose classical dynamics are not variational.Comment: Minor corrections, format changed, 40 page

Care needs and satisfaction with nursing care quality of cancer patients

Objective: This study aims to determine the relationships between care needs and satisfaction with nursing care quality of chemotherapy-treated cancer patients. Patients and Methods: This cross-sectional study was conducted between November and December 2021 in an Outpatient Chemotherapy Unit in Istanbul. The interview form consists of sociodemographic and treatment-related questions, cancer needs of patients, the satisfaction with the quality of nursing care. Results: Most of the participants were 55 years of age and older (61%), women (57.8%), had comorbid diseases (52.4%), and 48% were diagnosed with stage II cancer (48%). The care needs to be reported frequently by patients were mostly psychological and interpersonal communication. It was determined that the most important variables that increased the health care needs were perception by patients of their health status, age, stage of cancer, and the level of satisfaction they perceive together with the quality of nursing care. Conclusions: This study determined that patient care should be planned based on the factors affecting patient care needs and that care needs could decrease with increasing satisfaction with nursing care